New Approximation Algorithms for Max 2sat and Max Dicut
نویسندگان
چکیده
We propose a 0.935-approximation algorithm for MAX 2SAT and a 0.863-approximation algorithm for MAX DICUT. The approximation ratios improve upon the recent results of Zwick, which are equal to 0.93109 and 0.8596434254 respectively. Also proposed are derandomized versions of the same approximation ratios. We note that these approximation ratios are obtained by numerical computation rather than theoretical proof. The algorithms are based on the SDP relaxation proposed by Goemans and Williamson but do not use the ‘rotation’ technique proposed by Feige and Goemans. The improvements in the approximation ratios are obtained by the technique of ‘hyperplane separation with skewed distribution function on the sphere.’
منابع مشابه
Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this paper, we show that two prover proof systems are also convenient starting points for establishing easiness of approximation results. Our approach combines the Feige-Lovv asz (STOC92) semideenite programming relaxation of one-round two-prover proof systems, together wi...
متن کاملOn Weighted vs Unweighted Versions of Combinatorial Optimization Problems
We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and very general) definition of niceness, we show that if a nice weighted problem is hard to approximate within r, then its polynomially bounded weighted version is hard to approximate within r − o(1). Then we turn our attention to specific p...
متن کاملImproved Approximation Algorithms for Max-2SAT with Cardinality Constraint
The optimization problem Max-2SAT-CC is Max-2SAT with the additional cardinality constraint that the value one may be assigned to at most K variables. We present an approximation algorithm with polynomial running time for Max-2SAT-CC. This algorithm achieves, for any > 0, approximation ratio 6+3·e 16+2·e − ≈ 0.6603. Furthermore, we present a greedy algorithm with running time O(N logN) and appr...
متن کاملAn 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
Given a directed graph G and an edge weight function w : E(G) → R+, the maximum directed cut problem (max dicut) is that of finding a directed cut δ(X) with maximum total weight. In this paper we consider a version of max dicut — max dicut with given sizes of parts or max dicut with gsp — whose instance is that of max dicut plus a positive integer p, and it is required to find a directed cut δ(...
متن کاملPositive Linear Programming, Parallel Approximation and PCP's
Several sequential approximation algorithms are based on the following paradigm: solve a linear or semideenite programming relaxation , then use randomized rounding to convert fractional solutions of the relaxation into integer solutions for the original combinatorial problem. We demonstrate that such a paradigm can also yield parallel approximation algorithms by showing how to convert certain ...
متن کامل